268 research outputs found
Smart Meter Privacy with Renewable Energy and a Finite Capacity Battery
We address the smart meter (SM) privacy problem by considering the
availability of a renewable energy source (RES) and a battery which can be
exploited by a consumer to partially hide the consumption pattern from the
utility provider (UP). Privacy is measured by the mutual information rate
between the consumer's energy consumption and the renewable energy generation
process, and the energy received from the grid, where the latter is known by
the UP through the SM readings, and the former two are to be kept private. By
expressing the information leakage as an additive quantity, we cast the problem
as a stochastic control problem, and formulate the corresponding Bellman
equations.Comment: To appear in IEEE SPAWC 201
Learning-Based Optimization of Cache Content in a Small Cell Base Station
Optimal cache content placement in a wireless small cell base station (sBS)
with limited backhaul capacity is studied. The sBS has a large cache memory and
provides content-level selective offloading by delivering high data rate
contents to users in its coverage area. The goal of the sBS content controller
(CC) is to store the most popular contents in the sBS cache memory such that
the maximum amount of data can be fetched directly form the sBS, not relying on
the limited backhaul resources during peak traffic periods. If the popularity
profile is known in advance, the problem reduces to a knapsack problem.
However, it is assumed in this work that, the popularity profile of the files
is not known by the CC, and it can only observe the instantaneous demand for
the cached content. Hence, the cache content placement is optimised based on
the demand history. By refreshing the cache content at regular time intervals,
the CC tries to learn the popularity profile, while exploiting the limited
cache capacity in the best way possible. Three algorithms are studied for this
cache content placement problem, leading to different exploitation-exploration
trade-offs. We provide extensive numerical simulations in order to study the
time-evolution of these algorithms, and the impact of the system parameters,
such as the number of files, the number of users, the cache size, and the
skewness of the popularity profile, on the performance. It is shown that the
proposed algorithms quickly learn the popularity profile for a wide range of
system parameters.Comment: Accepted to IEEE ICC 2014, Sydney, Australia. Minor typos corrected.
Algorithm MCUCB correcte
Uncoded Caching and Cross-level Coded Delivery for Non-uniform File Popularity
Proactive content caching at user devices and coded delivery is studied
considering a non-uniform file popularity distribution. A novel centralized
uncoded caching and coded delivery scheme, which can be applied to large file
libraries, is proposed. The proposed cross-level coded delivery (CLCD) scheme
is shown to achieve a lower average delivery rate than the state of art. In the
proposed CLCD scheme, the same subpacketization is used for all the files in
the library in order to prevent additional zero-padding in the delivery phase,
and unlike the existing schemes in the literature, two users requesting files
from different popularity groups can be served by the same multicast message in
order to reduce the delivery rate. Simulation results indicate significant
reduction in the average delivery rate for typical Zipf distribution parameter
values.Comment: A shorter version of this paper has been presented at IEEE
International Conference on Communications (ICC) 201
Two-hop Communication with Energy Harvesting
Communication nodes with the ability to harvest energy from the environment
have the potential to operate beyond the timeframe limited by the finite
capacity of their batteries; and accordingly, to extend the overall network
lifetime. However, the optimization of the communication system in the presence
of energy harvesting devices requires a new paradigm in terms of power
allocation since the energy becomes available over time. In this paper, we
consider the problem of two-hop relaying in the presence of energy harvesting
nodes. We identify the optimal offline transmission scheme for energy
harvesting source and relay when the relay operates in the full-duplex mode. In
the case of a half-duplex relay, we provide the optimal transmission scheme
when the source has a single energy packet.Comment: 4 pages, 3 figures. To be presented at the 4th International Workshop
on Computational Advances in Multi-Sensor Adaptive Processing, Dec. 201
Fundamental Limits of Coded Caching: Improved Delivery Rate-Cache Capacity Trade-off
A centralized coded caching system, consisting of a server delivering N
popular files, each of size F bits, to K users through an error-free shared
link, is considered. It is assumed that each user is equipped with a local
cache memory with capacity MF bits, and contents can be proactively cached into
these caches over a low traffic period; however, without the knowledge of the
user demands. During the peak traffic period each user requests a single file
from the server. The goal is to minimize the number of bits delivered by the
server over the shared link, known as the delivery rate, over all user demand
combinations. A novel coded caching scheme for the cache capacity of M= (N-1)/K
is proposed. It is shown that the proposed scheme achieves a smaller delivery
rate than the existing coded caching schemes in the literature when K > N >= 3.
Furthermore, we argue that the delivery rate of the proposed scheme is within a
constant multiplicative factor of 2 of the optimal delivery rate for cache
capacities 1/K N >= 3.Comment: To appear in IEEE Transactions on Communication
Source-Channel Coding under Energy, Delay and Buffer Constraints
Source-channel coding for an energy limited wireless sensor node is
investigated. The sensor node observes independent Gaussian source samples with
variances changing over time slots and transmits to a destination over a flat
fading channel. The fading is constant during each time slot. The compressed
samples are stored in a finite size data buffer and need to be delivered in at
most time slots. The objective is to design optimal transmission policies,
namely, optimal power and distortion allocation, over the time slots such that
the average distortion at destination is minimized. In particular, optimal
transmission policies with various energy constraints are studied. First, a
battery operated system in which sensor node has a finite amount of energy at
the beginning of transmission is investigated. Then, the impact of energy
harvesting, energy cost of processing and sampling are considered. For each
energy constraint, a convex optimization problem is formulated, and the
properties of optimal transmission policies are identified. For the strict
delay case, , waterfilling interpretation is provided. Numerical
results are presented to illustrate the structure of the optimal transmission
policy, to analyze the effect of delay constraints, data buffer size, energy
harvesting, processing and sampling costs.Comment: 30 pages, 15 figures. Submitted to IEEE Transactions on Wireless
Communication
Energy Harvesting Broadband Communication Systems with Processing Energy Cost
Communication over a broadband fading channel powered by an energy harvesting
transmitter is studied. Assuming non-causal knowledge of energy/data arrivals
and channel gains, optimal transmission schemes are identified by taking into
account the energy cost of the processing circuitry as well as the transmission
energy. A constant processing cost for each active sub-channel is assumed.
Three different system objectives are considered: i) throughput maximization,
in which the total amount of transmitted data by a deadline is maximized for a
backlogged transmitter with a finite capacity battery; ii) energy maximization,
in which the remaining energy in an infinite capacity battery by a deadline is
maximized such that all the arriving data packets are delivered; iii)
transmission completion time minimization, in which the delivery time of all
the arriving data packets is minimized assuming infinite size battery. For each
objective, a convex optimization problem is formulated, the properties of the
optimal transmission policies are identified, and an algorithm which computes
an optimal transmission policy is proposed. Finally, based on the insights
gained from the offline optimizations, low-complexity online algorithms
performing close to the optimal dynamic programming solution for the throughput
and energy maximization problems are developed under the assumption that the
energy/data arrivals and channel states are known causally at the transmitter.Comment: published in IEEE Transactions on Wireless Communication
Wyner-Ziv Coding over Broadcast Channels: Digital Schemes
This paper addresses lossy transmission of a common source over a broadcast
channel when there is correlated side information at the receivers, with
emphasis on the quadratic Gaussian and binary Hamming cases. A digital scheme
that combines ideas from the lossless version of the problem, i.e.,
Slepian-Wolf coding over broadcast channels, and dirty paper coding, is
presented and analyzed. This scheme uses layered coding where the common layer
information is intended for both receivers and the refinement information is
destined only for one receiver. For the quadratic Gaussian case, a quantity
characterizing the overall quality of each receiver is identified in terms of
channel and side information parameters. It is shown that it is more
advantageous to send the refinement information to the receiver with "better"
overall quality. In the case where all receivers have the same overall quality,
the presented scheme becomes optimal. Unlike its lossless counterpart, however,
the problem eludes a complete characterization
Distortion Exponent in MIMO Channels with Feedback
The transmission of a Gaussian source over a block-fading multiple antenna
channel in the presence of a feedback link is considered. The feedback link is
assumed to be an error and delay free link of capacity 1 bit per channel use.
Under the short-term power constraint, the optimal exponential behavior of the
end-to-end average distortion is characterized for all source-channel bandwidth
ratios. It is shown that the optimal transmission strategy is successive
refinement source coding followed by progressive transmission over the channel,
in which the channel block is allocated dynamically among the layers based on
the channel state using the feedback link as an instantaneous automatic repeat
request (ARQ) signal.Comment: Presented at the IEEE Information Theory Workshop (ITW), Taormina,
Italy, Oct. 200
- …